A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
نویسندگان
چکیده
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Church–Rosser properties and functional computation model in symbolic and algebraic computation with induction. The algorithm which improved for Lambda-Beta Boolean reduction is simulated by the efficient logical programming language Prolog. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
A functional computation model for the duality of two-variable Lambda-Boolean functions
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on this model. With respect to this aim, some definitions and theorems which construct the model of the two-variable Lambda-Boolean functions are given. The simulation of the model is implemented in the programming language...
متن کاملThe next 700 Krivine machines
The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure λ-terms. While its original description has remained unpublished, this machine has served as a basis for many variants, extensions and theoretical studies. In this paper, we present the Krivine machine and some well-known variants in a common framework. Our framework consists of a hier...
متن کاملNon-Resolution Theorem Proving
This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Exampl...
متن کاملAlgebraic Complexity Theory
Algebraic complexity theory investigates the computational cost of solving problems with an algebraic flavor. Several cost measures are of interest. We consider arithmetic circuits, which can perform the (exact) arithmetic operations +, -, *, / at unit cost, and take their size ( = sequential time) or their depth (=parallel time) as cost functions. This is a natural "structured" model of comput...
متن کاملConnectionist-Symbolic Machine Intelligence using Cellular Automata based Reservoir-Hyperdimensional Computing
We introduce a novel framework of reservoir computing, that is capable of both connectionist machine intelligence and symbolic computation. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto the initial conditions of automaton cells and nonlinear computation is performed on the input via application of a rule in the automaton for a period of time....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 176 شماره
صفحات -
تاریخ انتشار 2006